Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
741	CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:48:52 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming 2-satisfiability Theoretical computer science Computational complexity theory Mathematics
742	Local Approximation Schemes for Ad Hoc and Sensor ∗ Networks Fabian Kuhn Thomas Moscibroda Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-23 16:10:38 NP-complete problems Dominating set Unit disk graph Connected dominating set Graph coloring Independent set Polynomial-time approximation scheme Bidimensionality Domatic number Graph theory Theoretical computer science Computational complexity theory
743	Bounds for cell entries in contingency tables given marginal totals and decomposable graphs Adrian Dobra and Stephen E. Fienberg* Department of Statistics and Center for Automated Learning and Discovery, Carnegie Mellon Add to Reading List Source URL: lib.stat.cmu.edu Language: English - Date: 2000-10-25 12:01:29 Clique Tree decomposition Vertex separator Connectivity Graph NP-complete problems Path decomposition Planar separator theorem Graph theory Graph operations Chordal graph
744	Stone Age Distributed Computing (Extended Abstract) Yuval Emek Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2013-07-12 10:24:45 NP-complete problems Network flow Graph coloring Model theory Graph partition Distributed computing Flow network Structure Consensus Mathematics Theoretical computer science Graph theory
745	CS 170 Fall 2006 — Discussion Handout #7 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 17:09:00 Network flow NP-complete problems Combinatorial optimization Maximum flow problem Flow network Vertex cover Matching Bipartite graph Connectivity Graph theory Mathematics Theoretical computer science
746	CS 170 Fall 2006 — Discussion Handout #8 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 16:42:32 Operations research Network theory NP-complete problems Convex optimization Linear programming Shortest path problem Maximum flow problem Simplex algorithm Vertex cover Graph theory Mathematics Theoretical computer science
747	CS 170 Fall 2006 — Discussion Handout #9 November 30, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-12-10 01:57:12 NP-complete problems Graph coloring Dominating set NP-complete Chromatic polynomial Graph theory Theoretical computer science Mathematics
748	On-line secret sharing∗ L´aszl´o Csirmaz† Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2010-07-08 09:38:19 NP-complete problems Graph coloring Line graph Hypergraph Connectivity Triangle SL Entropy Secret sharing Graph theory Theoretical computer science Mathematics
749	Variations on a Game∗ J.Beck Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2009-05-20 09:44:59 Graph Positional game Determinacy End Maker-Breaker game NP-complete problems Graph theory Hypergraph Graph coloring
750	Secret sharing on trees: problem solved L´aszl´o Csirmaz∗ Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2009-02-12 06:27:04 NP-complete problems Tree Graph Vertex cover Graph operations Graph coloring Path decomposition Pseudoforest Graph theory Mathematics Theoretical computer science